A local approach to automated correction of violated precedence and resource constraints in manually altered schedules
نویسندگان
چکیده
Users of automated scheduling systems frequently require an interactive approach to scheduling where they can manually modify the schedules. Because of complexity and cohesion of scheduling relations, it may happen that manual modification introduces flaws to the schedule, namely the altered schedule violates some constraints such as precedence relations or limited capacity of resources. It is useful to automatically correct these flaws while minimizing other required changes of the schedule. In this paper we suggest a fully automated approach to correcting violated precedence and unary resource constraints. The presented techniques attempt to alter minimally the existing schedule by doing the changes only locally in the area of the flaw.
منابع مشابه
SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملA Nurse Scheduling Model under Real Life Constraints
Background and Objectives: In this paper, a real life nurse scheduling model is described based on the conditions in Iranian hospitals such as monthly shift rotation, consecutive morning and evening shifts and consecutive evening and night shift. Methods: The developed model considers both hospital constraints and nurses’ preferences. Hospital constraints include assigning adequate qualifie...
متن کاملIntegrated Process Planning and Active Scheduling in a Supply Chain-A Learnable Architecture Approach
Through the lens of supply chain management, integrating process planning decisions and scheduling plans becomes an issue of great challenge and importance. Dealing with the problem paves the way to devising operation schedules with minimum makespan; considering the flexible process sequences, it can be viewed as a fundamental tool for achieving the scheme, too. To deal with this integration, t...
متن کاملFrom precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling
Constraint-based approaches to scheduling have typically formulated the problem as one of finding a consistent assignment of start times for each goal activity. In contrast, we are pursuing an approach that operates with a problem formulation more akin to least-commitment frameworks, where the objective is to post sufficient additional precedence constraints between pairs of activities contendi...
متن کاملSupply chain network design with multi- mode demand based on acceptance degree of fuzzy constraints violated
This paper designs a mathematical model for supply chain network design problem including plants, distributors and customers in fuzzy environment. Each plant and distributor has several levels capacities. A multi-mode demand strategy is considered for the customers where only one of the modes is to be selected for each customer. Considering the acceptance degree of fuzzy constraints violated, a...
متن کامل